NPDHunter: Efficient Null Pointer Dereference Vulnerability Detection in Binary
نویسندگان
چکیده
منابع مشابه
Efficient Binary Transfer of Pointer Structures
This paper presents a pair of algorithms for output and input of pointer structures in binary format. Both algorithms operate in linear space and time. They have been inspired by copying compacting garbage collection algorithms, and make similar assumptions about the representations of pointer structures. In real programs, the transfer of entire pointer structures is often inappropriate. The al...
متن کاملDetecting Null-dereference Bugs via a Backward Analysis
Null dereference is a common occurring bug in programming languages such as C. In this paper, we propose a path-sensitive and context-sensitive approach that performs a backward dataflow analysis to identify nulldereference bugs. One novel feature of our approach is that with the help of aliasing predicates, it can perform strong updates in presence of aliasing, thus eliminating false positives...
متن کاملDetecting Null Pointer Violations in Java Programs
The use of formal methods has been growing steadily and there have been a number of successful applications of formal methods in a range of application areas It seems agreed that quality should be assured by apply ing testing analysis and formal methods to rigorously de ned precode artifacts The detection of null pointer violation errors is de nitely such a goal This way of applying formal meth...
متن کاملNPEFix: Automatic Runtime Repair of Null Pointer Exceptions in Java
Null pointer exceptions, also known as null dereferences are the number one exceptions in the field. In this paper, we propose 9 alternative execution semantics when a null pointer exception is about to happen. We implement those alternative execution strategies using code transformation in a tool called NPEfix. We evaluate our prototype implementation on 11 field null dereference bugs and 519 ...
متن کاملTwo techniques to improve the precision of a demand-driven null-dereference verification approach
The problem addressed in this paper is sound, scalable, demand-driven null-dereference verification for Java programs. Our approach consists conceptuallyof a base analysis, plus two major extensions for enhanced precision. The baseanalysis is a dataflow analysis wherein we propagate formulas in the backwarddirection from a given dereference, and compute a necessary condition at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3091209